import java.util.Arrays;
import java.util.Scanner;

public class WalkGrid2 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        sc.close();
        int a[][] = new int[n][m];
        for (int i = 0; i < n; i++) {
            a[i][0]=1;
        }
        for (int i = 0; i < m; i++) {
            a[0][i]=1;
        }

        for (int i = 1 ; i < n ; i++){
            for (int j = 1 ; j < m ; j++){
                if ((i+1)%2==0&&(j+1)%2==0) {
                    continue;
                }
                a[i][j]=a[i-1][j]+a[i][j-1];
            }
        }
        System.out.println(a[n-1][m-1]);
    }
}
